#include <iostream>
#include <cstdio>
using namespace std;

const int N = 25;

typedef long long LL;

LL a, b, c;
LL f[N][N][N]; // 备忘录

LL dfs(LL a, LL b, LL c)
{
	if (a <= 0 || b <= 0 || c <= 0)	return 1;
	if (a > 20 || b > 20 || c > 20)	return dfs(20, 20, 20);

	if (f[a][b][c]) return f[a][b][c];

	if (a < b && b < c)	return f[a][b][c] = dfs(a, b, c - 1) + dfs(a, b - 1, c - 1) - dfs(a, b - 1, c);
	else 
		return f[a][b][c] = 
			dfs(a - 1, b, c) + 
			dfs(a - 1, b - 1, c) + 
			dfs(a - 1, b, c - 1) - 
			dfs(a - 1, b - 1, c - 1);
}

int main()
{
	while (cin >> a >> b >> c)
	{
		if ((a == -1) && (b == -1) && (c == -1))	break;

		printf("w(%lld, %lld, %lld) = %lld\n", a, b, c, dfs(a, b, c));
	}

	return 0;
}